Relaxed voting and competitive location under monotonous gain functions on trees
نویسندگان
چکیده
منابع مشابه
Relaxed voting and competitive location on trees under monotonous gain functions
We examine problems of placing facilities in a tree graph to serve customers. The decision of placement is driven by an election process amongst the users, where the user preference is modeled by distances in the tree. Relaxed user preferences introduce a tolerance of users against small di erences in distances. Monotonous gain functions are introduced to provide general results of which well k...
متن کاملA Linear Time Algorithm for Absolute Optima under Monotonous Gain Functions on Trees
We examine problems of placing facilities in a tree graph to serve customers. The decision of placement is driven by an election process amongst the users, where the user preference is modeled by distances in the tree. Relaxed user preferences introduce a tolerance of users against small di erences in distances. Monotonous gain functions are a natural generalization of well known competitive an...
متن کاملRelaxed Quasimonotone Operators and Relaxed Quasiconvex Functions
In this paper, we introduce the class of multivalued relaxed μ quasimonotone operators and establish the existence of solutions of variational inequalities for such operators. This result is compared with a recent result of Bai et al on densely relaxed pseudomonotone operators. A similar comparison regarding an existence result of Luc on densely pseudomonotone operators is provided. Also, we in...
متن کاملClique-Relaxed Competitive Graph Coloring
In this paper we investigate a variation of the graph coloring game, as studied in [2]. In the original coloring game, two players, Alice and Bob, alternate coloring vertices on a graph with legal colors from a fixed color set, where a color α is legal for a vertex if said vertex has no neighbors colored α. Other variations of the game change this definition of a legal color. For a fixed color ...
متن کاملRelaxed Balanced Red-Black Trees
Relaxed balancing means that, in a dictionary stored as a balanced tree, the necessary rebalancing after updates may be delayed. This is in contrast to strict balancing meaning that rebalancing is performed immediately after the update. Relaxed balancing is important for efficiency in highly dynamic applications where updates can occur in bursts. The rebalancing tasks can be performed gradually...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2010
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.05.006